Approximate Reasoning in First-Order Logic Theories
نویسندگان
چکیده
Many computational settings are concerned with finding (all) models of a first-order logic theory for a fixed, finite domain. In this paper, we present a method to compute from a given theory and finite domain an approximate structure: a structure that approximates all models. We show confluence of this method and investigate its complexity. We discuss some applications, including 3-valued query answering in integrated and partially incomplete databases, and improved grounding in the context of model expansion for first-order logic.
منابع مشابه
On the compactness property of extensions of first-order G"{o}del logic
We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...
متن کاملKnowledge and Data Fusion in Probabilistic Networks
Probability theory provides the theoretical basis for a logically coherent process of combining prior knowledge with empirical data to draw plausible inferences and to refine theories as observations accrue. Increases in the expressive power of languages for expressing probabilistic theories have been accompanied by refinements and adaptations of Bayesian learning methods to handle the more exp...
متن کاملReasoning and Decision Making
2 Knowledge Representation and Reasoning (1p) 3 2.1 Logic and Combinatorics (1p) . . . . . . . . . . . . . . . . . . . . 4 2.1.1 Propositional Reasoning and Constraints Satisfaction (1p) 4 2.1.2 First-Order Logic and Its Restrictions (1.5p) . . . . . . . 5 2.1.3 Knowledge, Belief, Agents, and Modal Logic (0.75p) . . . 6 2.1.4 Logic Programming, Nonmonotonic Reasoning, and Preferences (0.75p) . ...
متن کاملA Logic for Approximate First-Order Reasoning
In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the first-order case is only semi-decidable. Even in the restricted case of finite universes of discourse, reasoning remains inherently intractable, as the reasoner has to deal with two independent sources of complexity: unbounded c...
متن کاملObject-Oriented First-Order Logic
We wish to improve modeling in first-order logic (FOL) by using object-oriented tools. To this end, we describe Object-Oriented First-Order Logic (OOFOL), which is a simple extension of FOL. It does not surpass the expressive power of FOL, but it provides object-oriented tools to the knowledge engineer. In OOFOL, objects are theories that are connected via interface vocabularies to other object...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008